4/3 Rectangle Tiling lower bound
نویسندگان
چکیده
The problem that we consider is the following: given an n × n array A of positive numbers, find a tiling using at most p rectangles (which means that each array element must be covered by some rectangle and no two rectangles must overlap) that minimizes the maximum weight of any rectangle (the weight of a rectangle is the sum of elements which are covered by it). We prove that it is NP-hard to approximate this problem to within a factor of 1 1 3 (the previous best result was 1 1 4).
منابع مشابه
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms
We prove the following upper and lower bounds on the exact size of binary space partition (BSP) trees for a set of n isothetic rectangles in the plane: • An upper bound of 3n− 1 in general, and an upper bound of 2n− 1 if the rectangles tile the underlying space. This improves the upper bounds of 4n in [V. Hai Nguyen and P. Widmayer, Binary Space Partitions for Sets of Hyperrectangles, Lecture N...
متن کاملA 2(1/8)-Approximation Algorithm for Rectangle Tiling
Many problems arising in such areas of computer science as load balancing in parallel computing environments, data compression, and query optimization in databases require partitioning a multidimensional data set into rectangular parts or tiles so that some optimality criteria are satisfied. The one we examine can be stated as follows. The RTILE problem Given an n× n array A of nonnegative numb...
متن کاملPolynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings
We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall, and Spencer in 2002 [10]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form ...
متن کاملBreaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, which gives a formula size lower bound by showing a feasible solution of the dual problem of its LP-relaxation. As extensions of the LP bound, we introduce novel general techniques proving formula size lower bounds, name...
متن کاملTromino tilings of domino-deficient rectangles
In this paper I have settled the open problem, posed by J. Marshall Ash and S. Golomb in [4], of tiling an m × n rectangle with L-shaped trominoes, with the condition that 3 |(mn 2) and a domino is removed from the given rectangle. It turns out that for any given m, n ≥ 7, the only pairs of squares which prevent a tiling are {(1,2), (2,2)}, {(2,1), (2,2)}, {(2,3), (2,4)}, {(3,2), (4,2)} and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.01475 شماره
صفحات -
تاریخ انتشار 2017